Strong normalization property for second order linear logic
نویسندگان
چکیده
منابع مشابه
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which is not proven. We introduce sliced pure structures (sps), a very general version of Girard’s proof-nets, and we apply to sps Gandy’s method to infer SN from weak normalization (WN). We prove a standardization theorem for s...
متن کاملLinear Logic and Strong Normalization
Strong normalization for linear logic requires elaborated rewriting techniques. In this paper we give a new presentation of MELL proof nets, without any commutative cut-elimination rule. We show how this feature induces a compact and simple proof of strong normalization, via reducibility candidates. It is the first proof of strong normalization for MELL which does not rely on any form of conflu...
متن کاملStrong normalization of a symmetric lambda calculus for second-order classical logic
We extend Barbanera and Berardi’s symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
متن کاملStrong normalization of the second-order symmetric lambda mu -calculus
Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the second-order λμ-calculus with such rules.
متن کاملStrong Normalization of Second Order Symmetric lambda-Calculus
Parigot suggested symmetric structural reduction rules for application to μ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order λμ-calculus with these rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.053